/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-03-24
 * Time: 10:34
 */
class Solution {
    public int minPathSum(int[][] grid) {
        //  1.创建dp表
        int m = grid.length, n = grid[0].length;
        int[][] dp = new int[m+1][n+1];
        //2.初始化
        for(int i = 0; i <= m; i++) {
            dp[i][0] = Integer.MAX_VALUE;
        }
        for(int j = 0; j <=n; j++) {
            dp[0][j] = Integer.MAX_VALUE;
        }
        dp[0][1] = 0;
        //3.状态转移
        //4.填表顺序
        for(int i = 1; i < m+1; i++) {
            for(int j = 1; j < n+1; j++) {
                dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1])+grid[i-1][j-1];
            }
        }
        //5.返回结果
        return dp[m][n];
    }
}